A constructive count of rotation symmetric functions
نویسندگان
چکیده
In this paper we present a constructive detection of minimal monomials in the algebraic normal form of rotation symmetric Boolean functions (immune to circular translation of indices). This helps in constructing rotation symmetric Boolean functions by respecting the rules we present here. 2003 Elsevier B.V. All rights reserved.
منابع مشابه
Counting rotation symmetric functions using Polya's theorem
Homogeneous rotation symmetric (invariant under cyclic permutation of the variables) Boolean functions have been extensively studied in recent years due to their applications in cryptography. In this paper we give an explicit formula for the number of homogeneous rotation symmetric functions over the finite field GF(pm) using Polya’s enumeration theorem, which completely solves the open problem...
متن کاملRotation Symmetric Boolean Functions -; Count and Cryptographic Properties
In 1999, Pieprzyk and Qu presented rotation symmetric (RotS) functions as components in the rounds of hashing algorithm. Later, in 2002, Cusick and Stănică presented further advancement in this area. This class of Boolean functions are invariant under circular translation of indices. In this paper, using Burnside’s lemma, we prove that the number of n-variable rotation symmetric Boolean functio...
متن کاملThe Weight and Nonlinearity of 2-rotation Symmetric Cubic Boolean Function
The conceptions of χ-value and K-rotation symmetric Boolean functions are introduced by Cusick. K-rotation symmetric Boolean functions are a special rotation symmetric functions, which are invariant under the k − th power of ρ. In this paper, we discuss cubic 2-value 2-rotation symmetric Boolean function with 2n variables, which denoted by F2n(x2n). We give the recursive formula of weight of F2...
متن کاملClasses of Plateaued Rotation Symmetric Boolean Functions under Transformation of Walsh Spectra
Construction methods of Boolean functions with cryptographically significant properties is an important and difficult problem. In this work we investigate the class of rotation symmetric Boolean functions (RSBFs). These functions are invariant under circular translation of indices and were mainly introduced for efficient implementation purposes. First, we derive general results on these functio...
متن کاملRotation Symmetric Bent Boolean Functions for n = 2p
It has been conjectured that there are no homogeneous rotation symmetric bent Boolean functions of degree greater than two. In this paper we begin by proving that sums of short-cycle rotation symmetric bent Boolean functions must contain a specific degree two monomial rotation symmetric Boolean function. We then prove most cases of the conjecture in n=2p, p>2 prime, variables and extend this wo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 88 شماره
صفحات -
تاریخ انتشار 2003